A sequential Stackelberg game for dynamic inspection problems

• We introduce a multistage Stackelberg game for inspections with multiple targets. propose two solutions methods, using backward induction and linear programming. provide an explicit solution inspection where one inspector has the role of monitoring group inspectees. The resources to visit only few them. Visits are performed sequentially no repetitions. inspectees report share sequence as they occur, but otherwise, do not cooperate. formulate models, static commits play visits announced at start game, dynamic will depend on who was visited previously. In we characterize (randomized) paths in equilibrium programs. determine induction. Our paper focuses mathematical structure equilibria this sequential can perform exactly visits. transportation problem. use equivalence show that set path probabilities equilibrium, projected onto its first second marginals, is convex. discuss how games relate each other these models practical settings.